Technical Appendix for "Sequentially Optimal Mechanisms"

نویسنده

  • Vasiliki Skreta
چکیده

This document contains a number of omitted proofs and a more "formal" proof of the main theorem of the paper "Sequentially Optimal Mechanisms." 1. Omitted and Detailed Proofs for the Case that T = 2 Proof of Proposition 2 Step 1 We start by proving existence of the solution of the seller’s problem when T = 1. The seller seeks to solve

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Appendix for Demand Analysis using Strategic Reports: An application to a school choice mechanism (Not for Publication)

The appendix follows the organization of the paper. Appendix A describes the data sources and the cleaning process, appendix B presents technical details relevant for section 5. These include details on condition 1 and limit equilibria, details on RSP+C mechanisms and proofs of results presented in that section. Appendix C presents technical details relevant for section 6, including proofs and ...

متن کامل

On Sequentially Cohen-macaulay Complexes and Posets

The classes of sequentially Cohen-Macaulay and sequentially homotopy Cohen-Macaulay complexes and posets are studied. First, some different versions of the definitions are discussed and the homotopy type is determined. Second, it is shown how various constructions, such as join, product and rank-selection preserve these properties. Third, a characterization of sequential Cohen-Macaulayness for ...

متن کامل

Extensions on "Sequentially Optimal Mechanisms"

This document establishes that the result in "Sequentially Optimal Mechanisms" is robust to a number of extensions. 1. Robustness: Longer Horizon & Alternative Degrees of Transparency We will show that our result is robust in a number of di¤erent directions. The …rst extension considers the possibility that the game lasts arbitrarily long, but …nitely many periods. The next three extensions are...

متن کامل

Dynamic Mechanism Design with Hidden Income and Hidden Actions: Technical Appendix

In our paper “Dynamic Mechanism Design with Hidden Income and Hidden Actions,” we develop general recursive methods to solve for optimal contracts in dynamic principal-agent models with hidden income and hidden actions. This appendix provides the detailed derivations of all recursive formulations presented in the paper, as well as proofs for all propositions. Matthias Doepke: Department of Econ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005